package leetcode;

/**
 * @author ht
 * @create 2025-06-23 20:37
 * @desc
 **/
public class T70 {

    public int climbStairs(int n) {
        if(n <= 2) {
            return n;
        }
        int[] dp = new int[n + 1];
        dp[1] = 1;
        dp[2] = 2;

        for (int i = 3; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }

        return dp[n];
    }
}
